On a problem in elementary number theory and a combinatorial problem
نویسندگان
چکیده
منابع مشابه
On a Problem in Elementary Number Theory and a Combinatorial Problem
(1) f~(n) < exp [(log n) 1 /2 ]E Recently, I observed that using a combinatorial theorem due to Rado and myself (1) can be considerably improved and it might, in fact, be possible to obtain the correct order of magnitude for f 1 (n) . The combinatorial theorem in question states as follows [2] : Let g(k, t) be the smallest integer so that if A 1 , • • • , A 8 , s = g(k, t), are sets each having...
متن کاملOn a Combinatorial Problem in Number Theory
1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, one can always select a subsequence of g{N) integers with the property that no sum of two distinct integers of this subsequence belongs to the original sequence. It should be mentioned that the function ...
متن کاملAn Unsolvable Problem of Elementary Number Theory
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملOn a Combinatorial Problem in Group Theory
Let n be a positive integer or infinity (denote ∞). We denote by W ∗(n) the class of groups G such that, for every subset X of G of cardinality n + 1, there exist a positive integer k, and a subset X0 ⊆ X, with 2 ≤ |X0| ≤ n + 1 and a function f : {0, 1, 2, . . . , k} −→ X0, with f(0) 6= f(1) and non-zero integers t0, t1, . . . , tk such that [x0 0 , x t1 1 , . . . , x tk k ] = 1, where xi := f(...
متن کاملA combinatorial problem arising in group theory
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the quotient of a finite solvable group modulo the second Fitting subgroup in terms of the number of irreducible character degrees of the group. Along the way, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1964
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1964-0170852-8